On the Representation of Disk Graphs
نویسندگان
چکیده
For an arbitrary graph G, we consider the problem of deciding whether G is a disk graph (DG). The problem is known to be NP-hard, but it is open whether the problem actually is in NP. The problem is related to another open problem, the Polynomial Representation Hypothesis (PRH) for disk graphs: given an n-node disk graph G, can it be embedded in the plane such that the disk centers and disk radii have a binary representation in polynomially many bits. We give several reductions of the problem, and prove that the PRH for disk graphs is equivalent to another interesting and purely geometric conjecture, the Separation Hypothesis for DGs. We give an exact, exponential algorithm for recognizing DG’s that have an -separated embedding, for any given > 0. Most results apply ipso facto to unit disk graphs, and will generalize to ball graphs and unit ball graphs of fixed sphericity d > 2.
منابع مشابه
Product version of reciprocal degree distance of composite graphs
A {it topological index} of a graph is a real number related to the graph; it does not depend on labeling or pictorial representation of a graph. In this paper, we present the upper bounds for the product version of reciprocal degree distance of the tensor product, join and strong product of two graphs in terms of other graph invariants including the Harary index and Zagreb indices.
متن کاملA Tight Bound for Online Coloring of Disk Graphs
We present an improved upper bound on the competitiveness of the online coloring algorithm First-Fit in disk graphs, which are graphs representing overlaps of disks on the plane. We also show that this bound is best possible for deterministic online coloring algorithms that do not use the disk representation of the input graph. We also present a related new lower bound for unit disk graphs.
متن کاملFurther Information on Publisher's Website: Httpxggdxfdoiforggihfihhugwuveqettperrrtsev 2 2 Use Policy Minimum Bisection Is Np-hard on Unit Disk Graphs
In this paper we prove that the Min-Bisection problem is NP-hard on unit disk graphs, thus solving a longstanding open question.
متن کاملSome lower bounds for the $L$-intersection number of graphs
For a set of non-negative integers~$L$, the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$. The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملA PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs
We present a polynomial-time approximation scheme (PTAS) for the minimum dominating set problem in unit disk graphs. In contrast to previously known approximation schemes for the minimum dominating set problem on unit disk graphs, our approach does not assume a geometric representation of the vertices (specifying the positions of the disks in the plane) to be given as part of the input. The alg...
متن کامل